State-identification experiments in finite automata
نویسندگان
چکیده
منابع مشابه
Person Name Identification in Chinese Documents Using Finite State Automata
This research is about automatic identification and extraction of person names in Chinese text documents. Solutions to this problem have immediate and extensive applications in many areas especially in Web Intelligent Agents related applications such as Web search engines, Web data mining, and automatic Web information analysis. We have noted that while finite state automata (FSA) based techniq...
متن کاملResidual Finite State Automata
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover,...
متن کاملPreliminary Experiments in Hardcoding Finite Automata
Various experiments in hardcoding a single row of a transition table of a finite state machine directly into symbolrecognizing code are presented. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven algorithm. 1 The hardcoding Experiment The most commonly used algorithm to determine whether an input string is in the languag...
متن کاملExperiments with Finite Tree Automata in Coq
Tree automata are a fundamental tool in computer science. We report on experiments to integrate tree automata in Coq using shallow and deep reflection techniques. While shallow reflection seems more natural in this context, it turns out to give disappointing results. Deep reflection is more difficult to apply, but is more promising.
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1961
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(61)80003-x